About equivalent interval colorings of weighted graphs
نویسندگان
چکیده
منابع مشابه
About equivalent interval colorings of weighted graphs
Given a graph G = (V,E) with strictly positive integer weights ωi on the vertices i ∈ V , a k-interval coloring of G is a function I that assigns an interval I(i) ⊆ {1, · · · , k} of ωi consecutive integers (called colors) to each vertex i ∈ V . If two adjacent vertices x and y have common colors, i.e. I(i)∩ I(j) 6= ∅ for an edge [i, j] in G, then the edge [i, j] is said conflicting. A k-interv...
متن کاملInterval total colorings of graphs
A total coloring of a graph G is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An interval total t-coloring of a graph G is a total coloring of G with colors 1, 2,. .. , t such that at least one vertex or edge of G is colored by i, i = 1, 2,. .. , t, and the edges incident to each vertex v together with v ar...
متن کاملCircular colorings of weighted graphs
Suppose that G is a nite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t. A t-circular coloring of (G; w) is a mapping of the vertices of G to arcs of C such that (x)\(y) = if xy 2 E (G) and (x) has length w(x). The circular-chromatic number of (G; w) is the least t for which there is a t-circular coloring of (G;...
متن کاملInterval edge-colorings of composition of graphs
An edge-coloring of a graph G with consecutive integers c1, . . . , ct is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. The set of all interval colorable graphs is denoted by N. In 2004, Giaro and...
متن کاملInterval edge-colorings of complete graphs
An edge-coloring of a graph G with colors 1, 2, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an interval colorable graph G, W (G) denotes the greatest value of t for which G has an int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.04.015